//-*****************************************************************************
//
// Copyright (c) 2013,
//  Sony Pictures Imageworks Inc. and
//  Industrial Light & Magic, a division of Lucasfilm Entertainment Company Ltd.
//
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
// *       Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
// *       Redistributions in binary form must reproduce the above
// copyright notice, this list of conditions and the following disclaimer
// in the documentation and/or other materials provided with the
// distribution.
// *       Neither the name of Sony Pictures Imageworks, nor
// Industrial Light & Magic, nor the names of their contributors may be used
// to endorse or promote products derived from this software without specific
// prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
//
//-*****************************************************************************

#include "TreeEntry.h"

using namespace std;

namespace mariAlembic
{


void TreeEntry::printTree(TreeEntry &t, string tabs)
{
    for (unsigned int i=0; i< t.children.size(); i++)
    {
        cout << tabs << t.children[i]->shortName << ": " <<
            t.children[i]->type << endl;
        printTree(*(t.children[i]), tabs+"\t");
    }
}


void TreeEntry::markSelectedItem(TreeEntry &t, set<string> &selectedNames,
    set<string> &filteredShapes, bool isSelected)
{
    set<string>::iterator it = selectedNames.find(t.fullName);
    if (it != selectedNames.end())
    {
        t.isSelected = true;
        isSelected = true;
    }
    else
    {
        t.isSelected = isSelected;
    }

    if (isSelected)
    {
        filteredShapes.insert(t.fullName);
    }

    for(unsigned int i=0; i< t.children.size(); i++)
    {
        markSelectedItem(*(t.children[i]), selectedNames, filteredShapes,
            t.isSelected);
    }
}


void TreeEntry::markSelected(set<string> &selectedNames,
    set<string> &filteredShapes)
{
    for(unsigned int i=0; i< children.size(); i++)
    {
        markSelectedItem(*(children[i]), selectedNames, filteredShapes,
            false);
    }
}


}
